Quasigroup Associativity and Biased Expansion Graphs

نویسندگان

  • THOMAS ZASLAVSKY
  • Thomas Zaslavsky
چکیده

We present new criteria for a multary (or polyadic) quasigroup to be isotopic to an iterated group operation. The criteria are consequences of a structural analysis of biased expansion graphs. We mention applications to transversal designs and generalized Dowling geometries. 1. Associativity in multary quasigroups A multary quasigroup is a set with an n-ary operation for some finite n ≥ 2, say f : Q → Q, such that the equation f(x1, x2, . . . , xn) = x0 is uniquely solvable for any one variable given the values of the other n variables. An (associative) factorization is an expression f(x1, . . . , xn) = g(x1, . . . , xi, h(xi+1, . . . , xj), . . . , xn) (1) where g and h are multary quasigroup operations. For instance, if f is constructed by iterating a group operation, f(x1, . . . , xn) = x1 · x2 · · · · · xn, then it has every possible factorization. We study the degree to which an arbitrary multary quasigroup with some known factorizations is an iterated group. We employ a new method, the structural analysis of biased expansion graphs. An operation may be disguised by isotopy, which means relabelling each variable separately; or by conjugation, which means permuting the variables. Precisely, we call operations f and f ′ isotopic if there exist bijections αi : Q→ Q such that f (x1, . . . , xn) α0 = f(x1 1 , . . . , x αn n ); we call them circularly conjugate if x0 = f (x1, . . . , xn) ⇐⇒ xi = f(xi+1, . . . , xn, x0, x1, . . . , xi−1) or x0 = f (x1, . . . , xn) ⇐⇒ xi = f(xi−1, . . . , x1, x0, xn, . . . , xi+1) for some i = 0, 1, . . . , n. Neither isotopy nor circular conjugation affects the existence of factorizations. The exact factorization formulas may change under circular conjugation, but the factorizations of f and f ′ correspond. If a ternary quasigroup factors in both possible ways, f(x1, x2, x3) = g1(h1(x1, x2), x3) = g2(x1, h2(x2, x3)) (2) Date: May, 2004. Version of February 18, 2006. 2000 Mathematics Subject Classification. Primary 05C22, 20N05, Secondary 05B15, 05B35.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Associativity in Multiary Quasigroups: the Way of Biased Expansions

A multiary (polyadic, n-ary) quasigroup is an n-ary operation which is invertible with respect to each of its variables. A biased expansion of a graph is a kind of branched covering graph with additional structure similar to combinatorial homotopy of circles. A biased expansion of a circle with chords encodes a multiary quasigroup, the chords corresponding to factorizations, i.e., associative s...

متن کامل

Associativity in Multary Quasigroups: the Way of Biased Expansions

A biased expansion of a graph is a kind of branched covering graph with additional structure related to combinatorial homotopy of circles. Some but not all biased expansions are constructed from groups (group expansions); these include all biased expansions of complete graphs (assuming order at least four), which correspond to Dowling’s lattices of a group and encode an iterated group operation...

متن کامل

Right Product Quasigroups and Loops

Right groups are direct products of right zero semigroups and groups and they play a significant role in the semilattice decomposition theory of semigroups. Right groups can be characterized as associative right quasigroups (magmas in which left translations are bijective). If we do not assume associativity we get right quasigroups which are not necessarily representable as direct products of r...

متن کامل

Sharply transitive sets in quasigroup actions

This paper forms part of the general development of the theory of quasigroup permutation representations. Here, the concept of sharp transitivity is extended from group actions to quasigroup actions. Examples of nontrivial sharply transitive sets of quasigroup actions are constructed. A general theorem shows that uniformity of the action is necessary for the existence of a sharply transitive se...

متن کامل

Biased Expansions of Biased Graphs and their Chromatic Polynomials

Label each edge of a graph with a group element. Call the labels gains, and call the graph with this labeling a gain graph. A group expansion of an ordinary graph is an example of a gain graph. To construct one, replace each edge of a graph by several edges, one bearing as gain each possible value in a group. We introduce the concept of a group expansion of a gain graph. Then we find a formula ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006